Synthesis of a Path-Planning Algorithm for Autonomous Robots Moving in a Game Environment during Collision Avoidance

نویسندگان

چکیده

This paper describes and illustrates the optimization of a safe mobile robot control process in collision situations using model multistep matrix game many participants form dual linear programming problem. The synthesis non-cooperative cooperative software was performed Matlab/Simulink to determine path when passing greater number other robots obstacles. operation motion algorithm is illustrated by computer simulations made program two real previously recorded navigation while dozens autonomous robots.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path Planning and Collision Avoidance for Robots

An optimal control problem to find the fastest collision-free trajectory of a robot surrounded by obstacles is presented. The collision avoidance is based on linear programming arguments and expressed as state constraints. The optimal control problem is solved with a sequential programming method. In order to decrease the number of unknowns and constraints a backface culling active set strategy...

متن کامل

Formation Control and Path Planning of Two Robots for Tracking a Moving Target

This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...

متن کامل

PSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety

In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...

متن کامل

Path Planning and Collision Avoidance for

We have developed a planner for redundant manipula-tors that is fast, eeective and versatile, based on the idea of treating each link of a rigid-linked robot as if it were slightly exible and under the innuence of a potential eld. We describe the extensions to the basic method that allow it to plan paths for manipulators with revolute joints (linear and spherical joints having been covered in a...

متن کامل

Evolving Collision Avoidance on Autonomous Robots

Utilizing the collective behavior of a population of interacting individuals, based on rather simple local algorithms, is a promising approach for achieving complex goals. We use an onboard online evolutionary model, based on finite Moore automata, to develop collective behavior in an artificial swarm of micro-robots. Experiments have been made in simulation to achieve Collision Avoidance. The ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2021

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics10060675